<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.10"/>
<title>Introduction_to_Algorithms: src/tree_algorithms/searchtree/searchtree_test.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Introduction_to_Algorithms
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.10 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('searchtree__test_8h_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div class="header">
  <div class="headertitle">
<div class="title">searchtree_test.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="searchtree__test_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;<span class="comment">/*</span></div>
<div class="line"><a name="l00002"></a><span class="lineno">    2</span>&#160;<span class="comment"> * Copyright 2016- huaxz &lt;huaxz1986@163.com&gt;</span></div>
<div class="line"><a name="l00003"></a><span class="lineno">    3</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00004"></a><span class="lineno">    4</span>&#160;<span class="comment"> * This program is free software: you can redistribute it and/or modify</span></div>
<div class="line"><a name="l00005"></a><span class="lineno">    5</span>&#160;<span class="comment"> * it under the terms of the GNU General Public License as published by</span></div>
<div class="line"><a name="l00006"></a><span class="lineno">    6</span>&#160;<span class="comment"> * the Free Software Foundation, either version 2 of the License, or</span></div>
<div class="line"><a name="l00007"></a><span class="lineno">    7</span>&#160;<span class="comment"> * (at your option) any later version.</span></div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="comment"> * along with this program.  If not, see &lt;http://www.gnu.org/licenses/&gt;.</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="comment"> * Author: huaxz1986@163.com (huaxz)</span></div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;<span class="preprocessor">#ifndef SEARCHTREE_TEST</span></div>
<div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;<span class="preprocessor">#define SEARCHTREE_TEST</span></div>
<div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include&quot;src/google_test/gtest.h&quot;</span></div>
<div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;<span class="preprocessor">#include&quot;<a class="code" href="searchtree_8h.html">searchtree.h</a>&quot;</span></div>
<div class="line"><a name="l00023"></a><span class="lineno">   23</span>&#160;<span class="preprocessor">#include&quot;../binarytreenode/binarytreenode.h&quot;</span></div>
<div class="line"><a name="l00024"></a><span class="lineno">   24</span>&#160;<span class="preprocessor">#include&quot;../binarytree/binarytree.h&quot;</span></div>
<div class="line"><a name="l00025"></a><span class="lineno">   25</span>&#160;<span class="preprocessor">#include&lt;sstream&gt;</span></div>
<div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;</div>
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html">   27</a></span>&#160;<span class="keyword">namespace   </span>{</div>
<div class="line"><a name="l00028"></a><span class="lineno"><a class="line" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">   28</a></span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>=9;</div>
<div class="line"><a name="l00029"></a><span class="lineno">   29</span>&#160;}</div>
<div class="line"><a name="l00030"></a><span class="lineno">   30</span>&#160;</div>
<div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">using</span> <a class="code" href="class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree.html">IntroductionToAlgorithm::TreeAlgorithm::SearchTree</a>;</div>
<div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;<span class="keyword">using</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a>;</div>
<div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">IntroductionToAlgorithm::TreeAlgorithm::inorder_walk</a>;</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">IntroductionToAlgorithm::TreeAlgorithm::preorder_walk</a>;</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">IntroductionToAlgorithm::TreeAlgorithm::postorder_walk</a>;</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">using</span> <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5">IntroductionToAlgorithm::TreeAlgorithm::transplant</a>;</div>
<div class="line"><a name="l00037"></a><span class="lineno">   37</span>&#160;</div>
<div class="line"><a name="l00038"></a><span class="lineno">   38</span>&#160;</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="class_search_tree_test.html">   45</a></span>&#160;<span class="keyword">class </span><a class="code" href="class_search_tree_test.html">SearchTreeTest</a>:<span class="keyword">public</span> ::testing::Test</div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;{</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00048"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a921d5813f947eb9b70417b69722bc050">   48</a></span>&#160;    <span class="keyword">typedef</span> <a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">BinaryTreeNode&lt;int&gt;</a> <a class="code" href="class_search_tree_test.html#a921d5813f947eb9b70417b69722bc050">Node</a>;</div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;<span class="keyword">protected</span>:</div>
<div class="line"><a name="l00050"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a8499bee6e18b14298bb210e067d04e99">   50</a></span>&#160;    <a class="code" href="class_search_tree_test.html#a8499bee6e18b14298bb210e067d04e99">SearchTreeTest</a>(){}</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;</div>
<div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a90a211d1322c06e96bee25849525c77f">   57</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_search_tree_test.html#a90a211d1322c06e96bee25849525c77f">SetUp</a>()</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    {</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;        std::shared_ptr&lt;Node&gt; nodes[<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>];</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>;i++)</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;            nodes[i]=std::make_shared&lt;Node&gt;(i);</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        nodes[3]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[5]);</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;        nodes[7]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[5]);</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;        nodes[5]-&gt;lchild=nodes[3];</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;        nodes[5]-&gt;rchild=nodes[7];</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;        nodes[1]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[3]);</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        nodes[4]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[3]);</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;        nodes[3]-&gt;lchild=nodes[1];</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;        nodes[3]-&gt;rchild=nodes[4];</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;        nodes[6]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[7]);</div>
<div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;        nodes[8]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[7]);</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;        nodes[7]-&gt;lchild=nodes[6];</div>
<div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;        nodes[7]-&gt;rchild=nodes[8];</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div>
<div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;        nodes[0]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[1]);</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;        nodes[2]-&gt;parent=std::weak_ptr&lt;Node&gt;(nodes[1]);</div>
<div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;        nodes[1]-&gt;lchild=nodes[0];</div>
<div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;        nodes[1]-&gt;rchild=nodes[2];</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;        <a class="code" href="class_search_tree_test.html#a9982df0c932b171ff29dfe7abcebdc05">_normal_tree</a>.<a class="code" href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">root</a>=(nodes[5]);</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;        <span class="comment">/*           5</span></div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;<span class="comment">        *          /   \</span></div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;<span class="comment">        *         3     7</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;<span class="comment">        *        / \   /  \</span></div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;<span class="comment">        *       1   4 6    8</span></div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;<span class="comment">        *      / \</span></div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;<span class="comment">        *     0   2</span></div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;<span class="comment">        */</span></div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;</div>
<div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a2fff7db7a798909e087a66ce890f4f49">   97</a></span>&#160;    <span class="keywordtype">void</span> <a class="code" href="class_search_tree_test.html#a2fff7db7a798909e087a66ce890f4f49">TearDown</a>(){}</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;</div>
<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a08832932ab11e000dcd1ba60da8bad5f">   99</a></span>&#160;    <a class="code" href="class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree.html">SearchTree&lt;Node&gt;</a> <a class="code" href="class_search_tree_test.html#a08832932ab11e000dcd1ba60da8bad5f">_empty_tree</a>;   </div>
<div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="class_search_tree_test.html#a9982df0c932b171ff29dfe7abcebdc05">  100</a></span>&#160;    <a class="code" href="class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree.html">SearchTree&lt;Node&gt;</a> <a class="code" href="class_search_tree_test.html#a9982df0c932b171ff29dfe7abcebdc05">_normal_tree</a>;   </div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;};</div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;</div>
<div class="line"><a name="l00108"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">  108</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,search_test)</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;{</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    <span class="comment">// ***  空树  *******</span></div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    <span class="keyword">auto</span> result1=_empty_tree.search(0);</div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    EXPECT_FALSE(result1);</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    <span class="comment">//***   非空树 *******</span></div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <span class="keyword">auto</span> result2=_normal_tree.search(5);</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    ASSERT_TRUE(result2);</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;    EXPECT_EQ(result2.get(),_normal_tree.root.get());</div>
<div class="line"><a name="l00117"></a><span class="lineno">  117</span>&#160;</div>
<div class="line"><a name="l00118"></a><span class="lineno">  118</span>&#160;    <span class="keyword">auto</span> result3=_normal_tree.search(<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>);   <span class="comment">//无效的值</span></div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;    EXPECT_FALSE(result3);</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div>
<div class="line"><a name="l00121"></a><span class="lineno">  121</span>&#160;    <span class="keyword">auto</span> result4=_normal_tree.search(<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-1);</div>
<div class="line"><a name="l00122"></a><span class="lineno">  122</span>&#160;    ASSERT_TRUE(result4);</div>
<div class="line"><a name="l00123"></a><span class="lineno">  123</span>&#160;    EXPECT_EQ(result4-&gt;key,<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-1);</div>
<div class="line"><a name="l00124"></a><span class="lineno">  124</span>&#160;}</div>
<div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;</div>
<div class="line"><a name="l00130"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#a810377c2abb5b2e2c5158812e87f752e">  130</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,min_test)</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;{</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;    <span class="comment">// ***  空树  *******</span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    EXPECT_THROW(_empty_tree.min(_empty_tree.root),std::invalid_argument);</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;    <span class="comment">//***   非空树 *******</span></div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    <span class="keyword">auto</span> result2=_normal_tree.min(_normal_tree.root);</div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    ASSERT_TRUE(result2);</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;    EXPECT_EQ(result2-&gt;key,0);</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;}</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;</div>
<div class="line"><a name="l00145"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#aabbbb1e32184a6ebccd002f78a7b1092">  145</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,max_test)</div>
<div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;{</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;    <span class="comment">// ***  空树  *******</span></div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;    EXPECT_THROW(_empty_tree.max(_empty_tree.root),std::invalid_argument);</div>
<div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;    <span class="comment">//***   非空树 *******</span></div>
<div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;    <span class="keyword">auto</span> result2=_normal_tree.max(_normal_tree.root);</div>
<div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;    ASSERT_TRUE(result2);</div>
<div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;    EXPECT_EQ(result2-&gt;key,<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-1);</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;}</div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;</div>
<div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#a2ea51a3ab8d806281630845e6491fc63">  160</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,predecesor_test)</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;{</div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;    <span class="comment">// ***  空树  *******</span></div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    EXPECT_THROW(_empty_tree.predecesor(_empty_tree.root),std::invalid_argument);</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;    <span class="comment">//***   非空树 *******</span></div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;    <span class="keyword">auto</span> max=_normal_tree.max(_normal_tree.root);</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;    <span class="keyword">auto</span> predecesor=_normal_tree.predecesor(max);</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;    EXPECT_EQ(predecesor-&gt;key,<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-2);</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-1;i++)    <span class="comment">//从最大值节点开始依次查找前驱</span></div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;    {</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;        predecesor=_normal_tree.predecesor(predecesor);</div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;        EXPECT_EQ(predecesor-&gt;key,NODE_NUM-2-i)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;    }   </div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;}</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;</div>
<div class="line"><a name="l00179"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#ae2e2f8518465d9801762763620625514">  179</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,successor_test)</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;{</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;    <span class="comment">// ***  空树  *******</span></div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;    EXPECT_THROW(_empty_tree.successor(_empty_tree.root),std::invalid_argument);</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;    <span class="comment">//***   非空树 *******</span></div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;    <span class="keyword">auto</span> min=_normal_tree.min(_normal_tree.root);</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    <span class="keyword">auto</span> successor=_normal_tree.successor(min);</div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;    EXPECT_EQ(successor-&gt;key,1);</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1;i&lt;<a class="code" href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">NODE_NUM</a>-1;i++)  <span class="comment">//从最小值节点开始依次查找后继</span></div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;    {</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;        successor=_normal_tree.successor(successor);</div>
<div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;        EXPECT_EQ(successor-&gt;key,i+1)&lt;&lt;<span class="stringliteral">&quot;i:&quot;</span>&lt;&lt;i;</div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;    }</div>
<div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;}</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div>
<div class="line"><a name="l00199"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#aab034a0279366ae00e507984c354ca91">  199</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,insert_test)</div>
<div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;{</div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;    <span class="comment">// ****  空树  ********</span></div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;   {</div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;        <span class="keyword">auto</span> node=std::make_shared&lt;BinaryTreeNode&lt;int&gt;&gt;(1234);</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;        _empty_tree.insert(node);</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;        EXPECT_EQ(_empty_tree.root,node);</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;    }</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;    <span class="comment">// *****  非空树 ************</span></div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;    {</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        <span class="keyword">auto</span> node=std::make_shared&lt;BinaryTreeNode&lt;int&gt;&gt;(1234);</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;        _normal_tree.insert(node);</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;        {</div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;0;1;2;3;4;5;6;7;8;1234;&quot;</span>);</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;        }</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        {</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;5;3;1;0;2;4;7;6;8;1234;&quot;</span>);</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;        }</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;</div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                <span class="comment">/*           5</span></div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;<span class="comment">                *          /   \</span></div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;<span class="comment">                *         3     7</span></div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;<span class="comment">                *        / \   /  \</span></div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;<span class="comment">                *       1   4 6    8</span></div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;<span class="comment">                *      / \           \</span></div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;<span class="comment">                *     0   2          1234</span></div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;<span class="comment">                */</span></div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;        <span class="keyword">auto</span> node2=std::make_shared&lt;BinaryTreeNode&lt;int&gt;&gt;(10);</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;        _normal_tree.insert(node2);</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;        {</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;0;1;2;3;4;5;6;7;8;10;1234;&quot;</span>);</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;        }</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;        {</div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;5;3;1;0;2;4;7;6;8;1234;10;&quot;</span>);</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;        }</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;                <span class="comment">/*           5</span></div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;<span class="comment">                *          /   \</span></div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;<span class="comment">                *         3     7</span></div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;<span class="comment">                *        / \   /  \</span></div>
<div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="comment">                *       1   4 6    8</span></div>
<div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;<span class="comment">                *      / \           \</span></div>
<div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;<span class="comment">                *     0   2          1234</span></div>
<div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;<span class="comment">                *                   /</span></div>
<div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;<span class="comment">                *                  10</span></div>
<div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;<span class="comment">                */</span></div>
<div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;    }</div>
<div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;}</div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;</div>
<div class="line"><a name="l00267"></a><span class="lineno"><a class="line" href="searchtree__test_8h.html#a5a3f74b6f963604381b73006a950eb3d">  267</a></span>&#160;<a class="code" href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a>(<a class="code" href="class_search_tree_test.html">SearchTreeTest</a>,remove_test)</div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;{</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;    <span class="comment">// ****  空树  ********</span></div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;   {</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;        <span class="keyword">auto</span> node=std::make_shared&lt;BinaryTreeNode&lt;int&gt;&gt;(1234);</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;        EXPECT_THROW(_empty_tree.remove(node),std::invalid_argument);</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;    }</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;    <span class="comment">// *****  非空树 ************</span></div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;   {</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        <span class="keyword">auto</span> node=std::make_shared&lt;BinaryTreeNode&lt;int&gt;&gt;(1234);  <span class="comment">//不是树的子节点</span></div>
<div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        EXPECT_THROW(_normal_tree.remove(node),std::invalid_argument);</div>
<div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;</div>
<div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;        _normal_tree.remove(_normal_tree.root);  <span class="comment">//删除一个拥有两个子节点的节点</span></div>
<div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;        {</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;0;1;2;3;4;6;7;8;&quot;</span>);</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        }</div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;        {</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;6;3;1;0;2;4;7;8;&quot;</span>);</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;        }</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        <span class="comment">/*           6</span></div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;<span class="comment">        *          /   \</span></div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;<span class="comment">        *         3     7</span></div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;<span class="comment">        *        / \      \</span></div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;<span class="comment">        *       1   4      8</span></div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;<span class="comment">        *      / \</span></div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;<span class="comment">        *     0   2</span></div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;<span class="comment">        */</span></div>
<div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;</div>
<div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;        _normal_tree.remove(_normal_tree.max(_normal_tree.root)-&gt;parent.lock());  <span class="comment">//删除一个只有单子节点的节点</span></div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        {</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00306"></a><span class="lineno">  306</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00307"></a><span class="lineno">  307</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00308"></a><span class="lineno">  308</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;0;1;2;3;4;6;8;&quot;</span>);</div>
<div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;        }</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;        {</div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;6;3;1;0;2;4;8;&quot;</span>);</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;        }</div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;        <span class="comment">/*           6</span></div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;<span class="comment">        *          /   \</span></div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;<span class="comment">        *         3     8</span></div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;<span class="comment">        *        / \</span></div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;<span class="comment">        *       1   4</span></div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;<span class="comment">        *      / \</span></div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;<span class="comment">        *     0   2</span></div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;<span class="comment">        */</span></div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;        _normal_tree.remove(_normal_tree.min(_normal_tree.root)); <span class="comment">//删除一个叶子节点</span></div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        {</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">inorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;1;2;3;4;6;8;&quot;</span>);</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;        }</div>
<div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;        {</div>
<div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;            std::ostringstream os;</div>
<div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;            <span class="keyword">auto</span> do_work=[&amp;os](<span class="keywordtype">int</span> val){ os&lt;&lt;val&lt;&lt;<span class="stringliteral">&quot;;&quot;</span>;};</div>
<div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;            <a class="code" href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">preorder_walk</a>(_normal_tree.root,do_work);</div>
<div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;            EXPECT_EQ(os.str(),<span class="stringliteral">&quot;6;3;1;2;4;8;&quot;</span>);</div>
<div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;        }</div>
<div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;        <span class="comment">/*           6</span></div>
<div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;<span class="comment">        *          /   \</span></div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;<span class="comment">        *         3     8</span></div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;<span class="comment">        *        / \</span></div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;<span class="comment">        *       1   4</span></div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;<span class="comment">        *        \</span></div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;<span class="comment">        *         2</span></div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;<span class="comment">        *</span></div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;<span class="comment">        */</span></div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;   }</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;}</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;<span class="preprocessor">#endif // SEARCHTREE_TEST</span></div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;</div>
<div class="ttc" id="class_search_tree_test_html_a08832932ab11e000dcd1ba60da8bad5f"><div class="ttname"><a href="class_search_tree_test.html#a08832932ab11e000dcd1ba60da8bad5f">SearchTreeTest::_empty_tree</a></div><div class="ttdeci">SearchTree&lt; Node &gt; _empty_tree</div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00099">searchtree_test.h:99</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a49b5467191bd51c25ad7e7bfbed51339"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a49b5467191bd51c25ad7e7bfbed51339">IntroductionToAlgorithm::TreeAlgorithm::postorder_walk</a></div><div class="ttdeci">void postorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">postorder_walk：二叉树的后序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00127">binarytree.h:127</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a3d57267cd5fea456f6e001dc22d07c85"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a3d57267cd5fea456f6e001dc22d07c85">IntroductionToAlgorithm::TreeAlgorithm::preorder_walk</a></div><div class="ttdeci">void preorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">preorder_walk：二叉树的前序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00101">binarytree.h:101</a></div></div>
<div class="ttc" id="class_search_tree_test_html_a921d5813f947eb9b70417b69722bc050"><div class="ttname"><a href="class_search_tree_test.html#a921d5813f947eb9b70417b69722bc050">SearchTreeTest::Node</a></div><div class="ttdeci">BinaryTreeNode&lt; int &gt; Node</div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00048">searchtree_test.h:48</a></div></div>
<div class="ttc" id="searchtree__test_8h_html_a0fe9da8e6c53f661978841622b26f43c"><div class="ttname"><a href="searchtree__test_8h.html#a0fe9da8e6c53f661978841622b26f43c">TEST_F</a></div><div class="ttdeci">TEST_F(SearchTreeTest, search_test)</div><div class="ttdoc">search_test:测试二叉搜索树的搜索 </div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00108">searchtree_test.h:108</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node_html"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_node.html">IntroductionToAlgorithm::TreeAlgorithm::BinaryTreeNode</a></div><div class="ttdoc">BinaryTreeNode：二叉树的节点，算法导论xx章xx节 </div><div class="ttdef"><b>Definition:</b> <a href="binarytreenode_8h_source.html#l00031">binarytreenode.h:31</a></div></div>
<div class="ttc" id="searchtree_8h_html"><div class="ttname"><a href="searchtree_8h.html">searchtree.h</a></div></div>
<div class="ttc" id="class_search_tree_test_html_a9982df0c932b171ff29dfe7abcebdc05"><div class="ttname"><a href="class_search_tree_test.html#a9982df0c932b171ff29dfe7abcebdc05">SearchTreeTest::_normal_tree</a></div><div class="ttdeci">SearchTree&lt; Node &gt; _normal_tree</div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00100">searchtree_test.h:100</a></div></div>
<div class="ttc" id="namespaceanonymous__namespace_02searchtree__test_8h_03_html_ac386a90cf11eb333ec452e8b3f1fcac4"><div class="ttname"><a href="namespaceanonymous__namespace_02searchtree__test_8h_03.html#ac386a90cf11eb333ec452e8b3f1fcac4">anonymous_namespace{searchtree_test.h}::NODE_NUM</a></div><div class="ttdeci">const int NODE_NUM</div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00028">searchtree_test.h:28</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_abd9431ca8d1a40f70b6c72c732fc5892"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#abd9431ca8d1a40f70b6c72c732fc5892">IntroductionToAlgorithm::TreeAlgorithm::inorder_walk</a></div><div class="ttdeci">void inorder_walk(std::shared_ptr&lt; NodeType &gt; root, ActionType action=[](typename NodeType::T){})</div><div class="ttdoc">inorder_walk：二叉树的中序遍历 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00077">binarytree.h:77</a></div></div>
<div class="ttc" id="namespace_introduction_to_algorithm_1_1_tree_algorithm_html_a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5"><div class="ttname"><a href="namespace_introduction_to_algorithm_1_1_tree_algorithm.html#a4fb6d9c7d8b75a8d6ec4ee79fc0b1de5">IntroductionToAlgorithm::TreeAlgorithm::transplant</a></div><div class="ttdeci">void transplant(std::shared_ptr&lt; NodeType &gt; node_src, std::shared_ptr&lt; NodeType &gt;node_dst, std::shared_ptr&lt; NodeType &gt; &amp;root)</div><div class="ttdoc">transplant：二叉树的剪切操作 </div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00249">binarytree.h:249</a></div></div>
<div class="ttc" id="class_search_tree_test_html"><div class="ttname"><a href="class_search_tree_test.html">SearchTreeTest</a></div><div class="ttdoc">SearchTreeTest:测试类，用于为测试提供基础数据 </div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00045">searchtree_test.h:45</a></div></div>
<div class="ttc" id="class_search_tree_test_html_a90a211d1322c06e96bee25849525c77f"><div class="ttname"><a href="class_search_tree_test.html#a90a211d1322c06e96bee25849525c77f">SearchTreeTest::SetUp</a></div><div class="ttdeci">void SetUp()</div><div class="ttdoc">SetUp:在每一个测试开始之前执行 </div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00057">searchtree_test.h:57</a></div></div>
<div class="ttc" id="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree_html_aa0d43af70ef50ff59740dced2e832074"><div class="ttname"><a href="struct_introduction_to_algorithm_1_1_tree_algorithm_1_1_binary_tree.html#aa0d43af70ef50ff59740dced2e832074">IntroductionToAlgorithm::TreeAlgorithm::BinaryTree::root</a></div><div class="ttdeci">std::shared_ptr&lt; NodeType &gt; root</div><div class="ttdef"><b>Definition:</b> <a href="binarytree_8h_source.html#l00059">binarytree.h:59</a></div></div>
<div class="ttc" id="class_search_tree_test_html_a8499bee6e18b14298bb210e067d04e99"><div class="ttname"><a href="class_search_tree_test.html#a8499bee6e18b14298bb210e067d04e99">SearchTreeTest::SearchTreeTest</a></div><div class="ttdeci">SearchTreeTest()</div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00050">searchtree_test.h:50</a></div></div>
<div class="ttc" id="class_search_tree_test_html_a2fff7db7a798909e087a66ce890f4f49"><div class="ttname"><a href="class_search_tree_test.html#a2fff7db7a798909e087a66ce890f4f49">SearchTreeTest::TearDown</a></div><div class="ttdeci">void TearDown()</div><div class="ttdoc">TearDown:在每一个测试结束之后执行 </div><div class="ttdef"><b>Definition:</b> <a href="searchtree__test_8h_source.html#l00097">searchtree_test.h:97</a></div></div>
<div class="ttc" id="class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree_html"><div class="ttname"><a href="class_introduction_to_algorithm_1_1_tree_algorithm_1_1_search_tree.html">IntroductionToAlgorithm::TreeAlgorithm::SearchTree</a></div><div class="ttdoc">SearchTree：二叉搜索树，算法导论12章 </div><div class="ttdef"><b>Definition:</b> <a href="searchtree_8h_source.html#l00033">searchtree.h:33</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="dir_8ed9dba4cd616b67da9b1338594e34e0.html">src</a></li><li class="navelem"><a class="el" href="dir_2a06141a7764b24a0bfc3200068bd811.html">tree_algorithms</a></li><li class="navelem"><a class="el" href="dir_8651736733b74ad481ef3c7c03f15201.html">searchtree</a></li><li class="navelem"><a class="el" href="searchtree__test_8h.html">searchtree_test.h</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.10 </li>
  </ul>
</div>
</body>
</html>
